0.02/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/0.10 % Command : run_vampire %s %d 0.10/0.30 % Computer : n016.cluster.edu 0.10/0.30 % Model : x86_64 x86_64 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.30 % Memory : 8042.1875MB 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.30 % CPULimit : 960 0.10/0.30 % WCLimit : 120 0.10/0.30 % DateTime : Thu Jul 2 06:48:35 EDT 2020 0.10/0.30 % CPUTime : 0.16/0.33 % (18652)dis+1_2:3_acc=on:add=large:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afp=40000:afq=2.0:amm=sco:anc=none:er=filter:fsr=off:gsp=input_only:gs=on:gsem=off:nm=64:newcnf=on:nwc=1_3 on theBenchmark 0.16/0.33 % (18653)dis+10_128_acc=on:add=off:add=off:afp=4000:afq=1.4:amm=off:bd=preordered:cond=on:fsr=off:fde=unused:gs=on:gsem=on:irw=on:lma=on:nm=64:nwc=1.2:nicw=on:sos=on:sp=occurrence:updr=off:uhcvi=on_40 on theBenchmark 0.16/0.33 % (18657)lrs+1002_1_av=off:er=filter:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:fsr=off:gs=on:gsem=off:irw=on:lma=on:nm=4:nwc=1:stl=30:sd=3:ss=axioms:st=1.5:sos=on_1 on theBenchmark 0.16/0.35 % (18644)lrs-11_4:1_afp=4000:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afq=2.0:anc=none:br=off:gs=on:lwlo=on:nm=64:nwc=3:stl=30:urr=on_2 on theBenchmark 0.16/0.35 % (18645)lrs+1011_8_add=large:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afp=100000:afq=1.1:er=filter:gsp=input_only:gs=on:gsem=on:lma=on:nm=6:nwc=1:stl=30:sd=2:ss=axioms:st=1.5:sos=on_3 on theBenchmark 0.16/0.35 % (18649)lrs+1011_5:1_acc=on:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:amm=off:anc=all_dependent:bd=off:ccuc=small_ones:fde=unused:gs=on:gsaa=full_model:gsem=off:lcm=predicate:lwlo=on:nm=6:newcnf=on:nwc=2.5:stl=30:sp=occurrence:updr=off_3 on theBenchmark 0.16/0.35 % (18666)lrs+1002_1_add=large:csup=on:inj=on:fe=off:chr=on:foolp=on:cnfonf=eager:afr=on:afp=1000:afq=1.1:amm=sco:anc=none:er=known:fsr=off:gs=on:gsem=off:lma=on:nm=2:newcnf=on:nwc=2:stl=30:sd=1:ss=axioms:st=5.0:sp=reverse_arity:updr=off_50 on theBenchmark 0.16/0.35 % (18653)Refutation not found, incomplete strategy 0.16/0.35 % (18653)------------------------------ 0.16/0.35 % (18653)Version: Vampire 4.5.0 (commit 7ae30c7f on 2020-06-30 15:57:20 +0100) 0.16/0.35 % (18653)Termination reason: Refutation not found, incomplete strategy 0.16/0.35 0.16/0.35 % (18653)Memory used [KB]: 9722 0.16/0.35 % (18653)Time elapsed: 0.028 s 0.16/0.35 % (18653)------------------------------ 0.16/0.35 % (18653)------------------------------ 0.16/0.35 % (18667)lrs+1011_5_add=large:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afp=1000:afq=1.2:anc=none:fsr=off:irw=on:lma=on:nm=64:newcnf=on:nwc=1:stl=30:sd=3:ss=axioms:st=2.0:sos=on:sac=on:sp=reverse_arity:urr=on:updr=off_130 on theBenchmark 0.16/0.35 % (18646)dis+10_128_acc=on:add=off:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afp=4000:afq=1.4:amm=off:bd=preordered:cond=on:fsr=off:fde=unused:gs=on:gsem=on:irw=on:lma=on:nm=64:nwc=1.2:nicw=on:sos=on:sp=occurrence:updr=off:uhcvi=on_2 on theBenchmark 0.16/0.35 % (18654)dis-11_3_add=off:afp=40000:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afq=1.0:amm=sco:anc=none:gs=on:irw=on:lcm=reverse:nm=6:nwc=1:sd=4:ss=axioms:st=3.0:sos=on:sac=on_2 on theBenchmark 0.16/0.35 % (18647)lrs+1010_8_add=off:afp=100000:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afq=1.0:amm=off:anc=none:irw=on:nm=16:newcnf=on:nwc=1.1:nicw=on:stl=30:sp=reverse_arity:urr=on_13 on theBenchmark 0.16/0.35 % (18643)ott+1002_2_av=off:bd=preordered:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:irw=on:lma=on:nm=64:nwc=10:sp=reverse_arity:updr=off_2 on theBenchmark 0.16/0.35 % (18648)ott+1002_8:1_add=off:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afr=on:afp=100000:afq=1.1:amm=off:anc=none:bd=off:bs=unit_only:fsr=off:gs=on:gsem=off:nm=32:nwc=10:sp=occurrence:urr=on:updr=off_14 on theBenchmark 0.16/0.35 % (18655)dis+1002_6_add=large:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afp=40000:afq=2.0:bsr=on:cond=on:irw=on:lma=on:nm=2:nwc=2.5:nicw=on:sp=reverse_arity:updr=off_2 on theBenchmark 0.16/0.35 % (18656)lrs+1010_3_av=off:fsr=off:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:gs=on:gsem=off:nm=2:newcnf=on:nwc=2:stl=30:sp=reverse_arity:urr=on:updr=off_9 on theBenchmark 0.16/0.35 % (18657)Refutation found. Thanks to Tanya! 0.16/0.35 % SZS status Theorem for theBenchmark 0.16/0.35 % (18658)ott+2_2_afp=10000:afq=1.4:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:amm=off:anc=none:gsp=input_only:gs=on:gsem=off:irw=on:lcm=predicate:nm=32:nwc=1.5:sos=on:sp=reverse_arity_7 on theBenchmark 0.16/0.36 % (18666)Refutation not found, incomplete strategy 0.16/0.36 % (18666)------------------------------ 0.16/0.36 % (18666)Version: Vampire 4.5.0 (commit 7ae30c7f on 2020-06-30 15:57:20 +0100) 0.16/0.36 % (18666)Termination reason: Refutation not found, incomplete strategy 0.16/0.36 0.16/0.36 % (18666)Memory used [KB]: 9722 0.16/0.36 % (18666)Time elapsed: 0.010 s 0.16/0.36 % (18666)------------------------------ 0.16/0.36 % (18666)------------------------------ 0.16/0.36 % (18650)lrs+4_3_av=off:br=off:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:nm=0:newcnf=on:nwc=1:stl=30:sp=occurrence:urr=on_32 on theBenchmark 0.16/0.36 % (18669)lrs+1_4_afp=100000:afq=1.2:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:anc=none:bd=off:cond=on:gs=on:gsem=off:nm=64:nwc=1:sd=2:ss=axioms:st=2.0:sos=all:updr=off_300 on theBenchmark 0.16/0.36 % (18670)lrs-11_4:1_afp=4000:csup=on:inj=on:mXXn=1:foolp=on:e2e=on:cnfonf=eager:afq=2.0:anc=none:br=off:gs=on:lwlo=on:nm=64:nwc=3:stl=30:urr=on_186 on theBenchmark 0.16/0.37 % (18672)dis-11_3_add=off:afp=40000:csup=on:inj=on:chr=on:e2e=on:prag=on:foolp=on:cnfonf=eager:afq=1.0:fde=all:amm=sco:anc=none:gs=on:irw=on:lcm=reverse:nm=6:nwc=1:sd=4:ss=axioms:st=3.0:sos=on:sac=on_50 on theBenchmark 0.16/0.37 % (18659)lrs+1010_3:2_afr=on:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afp=100000:afq=1.1:anc=none:gsp=input_only:irw=on:lwlo=on:nm=2:newcnf=on:nwc=1.7:sac=on:sp=occurrence_300 on theBenchmark 0.16/0.37 % (18671)dis+1002_4_add=large:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:afp=40000:afq=1.0:anc=none:cond=fast:fde=none:gs=on:gsaa=full_model:lma=on:lwlo=on:nm=0:nwc=1.5:sp=reverse_arity:tha=off_300 on theBenchmark 0.16/0.37 % (18665)dis+10_4_av=off:bsr=on:csup=on:inj=on:chr=on:foolp=on:cnfonf=eager:cond=fast:er=filter:fde=none:gsp=input_only:lcm=reverse:lma=on:nwc=4:sp=occurrence:urr=on_8 on theBenchmark 0.16/0.37 % (18668)lrs+1010_8_add=off:afp=100000:csup=on:inj=off:foolp=on:chr=off:e2e=on:cnfonf=eager:afq=1.0:amm=off:anc=none:irw=on:nm=16:newcnf=on:nwc=1.1:nicw=on:stl=30:sp=reverse_arity:urr=on_13 on theBenchmark 0.16/0.37 % SZS output start Proof for theBenchmark 0.16/0.37 tff(func_def_3, type, ->: ('$tType' * '$tType') > '$tType'). 0.16/0.37 tff(func_def_4, type, cG: '$o' -> '$o'). 0.16/0.37 tff(func_def_5, type, cF: '$o' -> '$o'). 0.16/0.37 tff(func_def_6, type, cP: ('$o' -> '$o') -> '$o'). 0.16/0.37 tff(func_def_7, type, vAPP: !>[X0: $ttype, X1: $ttype]:(X0 -> X1 * X0) > X1). 0.16/0.37 tff(func_def_8, type, vEPSILON: !>[X0: $ttype]:(X0 -> '$o') -> X0). 0.16/0.37 tff(func_def_11, type, vOR: '$o' -> '$o' -> '$o'). 0.16/0.37 tff(func_def_12, type, bCOMB: !>[X0: $ttype, X1: $ttype, X2: $ttype]:(X1 -> X2) -> (X0 -> X1) -> X0 -> X2). 0.16/0.37 tff(func_def_13, type, sCOMB: !>[X0: $ttype, X1: $ttype, X2: $ttype]:(X0 -> X1 -> X2) -> (X0 -> X1) -> X0 -> X2). 0.16/0.37 tff(func_def_14, type, vNOT: '$o' -> '$o'). 0.16/0.37 tff(func_def_15, type, cCOMB: !>[X0: $ttype, X1: $ttype, X2: $ttype]:(X0 -> X1 -> X2) -> X1 -> X0 -> X2). 0.16/0.37 tff(func_def_16, type, kCOMB: !>[X1: $ttype, X2: $ttype]:X1 -> X2 -> X1). 0.16/0.37 tff(func_def_17, type, iCOMB: !>[X2: $ttype]:X2 -> X2). 0.16/0.37 tff(f1,conjecture,( 0.16/0.37 (cP @ cF & cP @ cG) => (cP @ (^[X0 : '$o'] : cG @ X0 | ~cF @ X0) | cP @ (^[X0 : '$o'] : cG @ X0 | cF @ X0))), 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM627)). 0.16/0.37 tff(f2,negated_conjecture,( 0.16/0.37 ~((cP @ cF & cP @ cG) => (cP @ (^[X0 : '$o'] : cG @ X0 | ~cF @ X0) | cP @ (^[X0 : '$o'] : cG @ X0 | cF @ X0)))), 0.16/0.37 inference(negated_conjecture,[],[f1])). 0.16/0.37 tff(f3,plain,( 0.16/0.37 ~((cP @ cF & cP @ cG) => (cP @ (^[X0 : '$o'] : cG @ X0 | ~cF @ X0) | cP @ (^[X1 : '$o'] : cG @ X1 | cF @ X1)))), 0.16/0.37 inference(rectify,[],[f2])). 0.16/0.37 tff(f4,plain,( 0.16/0.37 ~(((cP @ cF = $true) & (cP @ cG = $true)) => ((cP @ (sCOMB @ (bCOMB @ vOR @ (bCOMB @ vNOT @ cF)) @ cG) = $true) | (cP @ (sCOMB @ (bCOMB @ vOR @ cF) @ cG) = $true)))), 0.16/0.37 inference(fool_elimination,[],[f3])). 0.16/0.37 tff(f5,plain,( 0.16/0.37 ((cP @ (sCOMB @ (bCOMB @ vOR @ (bCOMB @ vNOT @ cF)) @ cG) != $true) & (cP @ (sCOMB @ (bCOMB @ vOR @ cF) @ cG) != $true)) & ((cP @ cF = $true) & (cP @ cG = $true))), 0.16/0.37 inference(ennf_transformation,[],[f4])). 0.16/0.37 tff(f6,plain,( 0.16/0.37 (cP @ (sCOMB @ (bCOMB @ vOR @ (bCOMB @ vNOT @ cF)) @ cG) != $true) & (cP @ (sCOMB @ (bCOMB @ vOR @ cF) @ cG) != $true) & (cP @ cF = $true) & (cP @ cG = $true)), 0.16/0.37 inference(flattening,[],[f5])). 0.16/0.37 tff(f7,plain,( 0.16/0.37 (cP @ cG = $true)), 0.16/0.37 inference(cnf_transformation,[],[f6])). 0.16/0.37 tff(f8,plain,( 0.16/0.37 (cP @ cF = $true)), 0.16/0.37 inference(cnf_transformation,[],[f6])). 0.16/0.37 tff(f9,plain,( 0.16/0.37 (cP @ (sCOMB @ (bCOMB @ vOR @ cF) @ cG) != $true)), 0.16/0.37 inference(cnf_transformation,[],[f6])). 0.16/0.37 tff(f10,plain,( 0.16/0.37 (cP @ (sCOMB @ (bCOMB @ vOR @ (bCOMB @ vNOT @ cF)) @ cG) != $true)), 0.16/0.37 inference(cnf_transformation,[],[f6])). 0.16/0.37 tff(f14,plain,( 0.16/0.37 ($true != $true) | cG != sCOMB @ (bCOMB @ vOR @ cF) @ cG), 0.16/0.37 inference(superposition,[],[f9,f7])). 0.16/0.37 tff(f15,plain,( 0.16/0.37 ($true != $true) | cF != sCOMB @ (bCOMB @ vOR @ cF) @ cG), 0.16/0.37 inference(superposition,[],[f9,f8])). 0.16/0.37 tff(f16,plain,( 0.16/0.37 cF != sCOMB @ (bCOMB @ vOR @ cF) @ cG), 0.16/0.37 inference(trivial_inequality_removal,[],[f15])). 0.16/0.37 tff(f17,plain,( 0.16/0.37 cG != sCOMB @ (bCOMB @ vOR @ cF) @ cG), 0.16/0.37 inference(trivial_inequality_removal,[],[f14])). 0.16/0.37 tff(f20,plain,( 0.16/0.37 (cF @ sK0 != sCOMB @ (bCOMB @ vOR @ cF) @ cG @ sK0)), 0.16/0.37 inference(negative_extensionality,[],[f16])). 0.16/0.37 tff(f21,plain,( 0.16/0.37 (cF @ sK0 != vOR @ (cF @ sK0) @ (cG @ sK0))), 0.16/0.37 inference(combinator_demodulation,[],[f20])). 0.16/0.37 tff(f22,plain,( 0.16/0.37 (cF @ sK0 = $true) | (vOR @ (cF @ sK0) @ (cG @ sK0) = $true)), 0.16/0.37 inference(binary_proxy_clausification,[],[f21])). 0.16/0.37 tff(f23,plain,( 0.16/0.37 (cF @ sK0 = $false) | (vOR @ (cF @ sK0) @ (cG @ sK0) = $false)), 0.16/0.37 inference(binary_proxy_clausification,[],[f21])). 0.16/0.37 tff(f24,plain,( 0.16/0.37 (cF @ sK0 = $false) | (cF @ sK0 = $false)), 0.16/0.37 inference(binary_proxy_clausification,[],[f23])). 0.16/0.37 tff(f26,plain,( 0.16/0.37 (cF @ sK0 = $false)), 0.16/0.37 inference(duplicate_literal_removal,[],[f24])). 0.16/0.37 tff(f27,plain,( 0.16/0.37 (cF @ sK0 = $true) | (cF @ sK0 = $true) | (cG @ sK0 = $true)), 0.16/0.37 inference(binary_proxy_clausification,[],[f22])). 0.16/0.37 tff(f28,plain,( 0.16/0.37 (cF @ sK0 = $true) | (cG @ sK0 = $true)), 0.16/0.37 inference(duplicate_literal_removal,[],[f27])). 0.16/0.37 tff(f29,plain,( 0.16/0.37 ($false = $true) | (cG @ sK0 = $true)), 0.16/0.37 inference(backward_demodulation,[],[f26,f28])). 0.16/0.37 tff(f30,plain,( 0.16/0.37 (cG @ sK0 = $true)), 0.16/0.37 inference(trivial_inequality_removal,[],[f29])). 0.16/0.37 tff(f32,plain,( 0.16/0.37 ($true != $true) | cG != sCOMB @ (bCOMB @ vOR @ (bCOMB @ vNOT @ cF)) @ cG), 0.16/0.37 inference(superposition,[],[f10,f7])). 0.16/0.37 tff(f35,plain,( 0.16/0.37 cG != sCOMB @ (bCOMB @ vOR @ (bCOMB @ vNOT @ cF)) @ cG), 0.16/0.37 inference(trivial_inequality_removal,[],[f32])). 0.16/0.37 tff(f39,plain,( 0.16/0.37 (cG @ sK1 != sCOMB @ (bCOMB @ vOR @ cF) @ cG @ sK1)), 0.16/0.37 inference(negative_extensionality,[],[f17])). 0.16/0.37 tff(f40,plain,( 0.16/0.37 (cG @ sK1 != vOR @ (cF @ sK1) @ (cG @ sK1))), 0.16/0.37 inference(combinator_demodulation,[],[f39])). 0.16/0.37 tff(f41,plain,( 0.16/0.37 (cG @ sK1 = $true) | (vOR @ (cF @ sK1) @ (cG @ sK1) = $true)), 0.16/0.37 inference(binary_proxy_clausification,[],[f40])). 0.16/0.37 tff(f42,plain,( 0.16/0.37 (cG @ sK1 = $false) | (vOR @ (cF @ sK1) @ (cG @ sK1) = $false)), 0.16/0.37 inference(binary_proxy_clausification,[],[f40])). 0.16/0.37 tff(f44,plain,( 0.16/0.37 (cG @ sK1 = $false) | (cG @ sK1 = $false)), 0.16/0.37 inference(binary_proxy_clausification,[],[f42])). 0.16/0.37 tff(f45,plain,( 0.16/0.37 (cG @ sK1 = $false)), 0.16/0.37 inference(duplicate_literal_removal,[],[f44])). 0.16/0.37 tff(f46,plain,( 0.16/0.37 (cG @ sK1 = $true) | (cF @ sK1 = $true) | (cG @ sK1 = $true)), 0.16/0.37 inference(binary_proxy_clausification,[],[f41])). 0.16/0.37 tff(f47,plain,( 0.16/0.37 (cG @ sK1 = $true) | (cF @ sK1 = $true)), 0.16/0.37 inference(duplicate_literal_removal,[],[f46])). 0.16/0.37 tff(f48,plain,( 0.16/0.37 ($false = $true) | (cF @ sK1 = $true)), 0.16/0.37 inference(backward_demodulation,[],[f45,f47])). 0.16/0.37 tff(f49,plain,( 0.16/0.37 (cF @ sK1 = $true)), 0.16/0.37 inference(trivial_inequality_removal,[],[f48])). 0.16/0.37 tff(f59,plain,( 0.16/0.37 ($false = $true) | (sK0 != sK1)), 0.16/0.37 inference(superposition,[],[f26,f49])). 0.16/0.37 tff(f64,plain,( 0.16/0.37 (sK0 != sK1)), 0.16/0.37 inference(trivial_inequality_removal,[],[f59])). 0.16/0.37 tff(f65,plain,( 0.16/0.37 ($true = sK1) | ($true = sK0)), 0.16/0.37 inference(binary_proxy_clausification,[],[f64])). 0.16/0.37 tff(f66,plain,( 0.16/0.37 ($false = sK1) | ($false = sK0)), 0.16/0.37 inference(binary_proxy_clausification,[],[f64])). 0.16/0.37 tff(f78,plain,( 0.16/0.37 (cG @ sK3 != sCOMB @ (bCOMB @ vOR @ (bCOMB @ vNOT @ cF)) @ cG @ sK3)), 0.16/0.37 inference(negative_extensionality,[],[f35])). 0.16/0.37 tff(f79,plain,( 0.16/0.37 (cG @ sK3 != vOR @ (vNOT @ (cF @ sK3)) @ (cG @ sK3))), 0.16/0.37 inference(combinator_demodulation,[],[f78])). 0.16/0.37 tff(f80,plain,( 0.16/0.37 (cG @ sK3 = $true) | (vOR @ (vNOT @ (cF @ sK3)) @ (cG @ sK3) = $true)), 0.16/0.37 inference(binary_proxy_clausification,[],[f79])). 0.16/0.37 tff(f81,plain,( 0.16/0.37 (cG @ sK3 = $false) | (vOR @ (vNOT @ (cF @ sK3)) @ (cG @ sK3) = $false)), 0.16/0.37 inference(binary_proxy_clausification,[],[f79])). 0.16/0.37 tff(f83,plain,( 0.16/0.37 (cG @ sK3 = $false) | (cG @ sK3 = $false)), 0.16/0.37 inference(binary_proxy_clausification,[],[f81])). 0.16/0.37 tff(f84,plain,( 0.16/0.37 (cG @ sK3 = $false)), 0.16/0.37 inference(duplicate_literal_removal,[],[f83])). 0.16/0.37 tff(f86,plain,( 0.16/0.37 (cG @ sK3 = $true) | (vNOT @ (cF @ sK3) = $true) | (cG @ sK3 = $true)), 0.16/0.37 inference(binary_proxy_clausification,[],[f80])). 0.16/0.37 tff(f87,plain,( 0.16/0.37 (cG @ sK3 = $true) | (vNOT @ (cF @ sK3) = $true)), 0.16/0.37 inference(duplicate_literal_removal,[],[f86])). 0.16/0.37 tff(f88,plain,( 0.16/0.37 (cG @ sK3 = $true) | (cF @ sK3 = $false)), 0.16/0.37 inference(not_proxy_clausification,[],[f87])). 0.16/0.37 tff(f89,plain,( 0.16/0.37 ($false = $true) | (cF @ sK3 = $false)), 0.16/0.37 inference(backward_demodulation,[],[f84,f88])). 0.16/0.37 tff(f90,plain,( 0.16/0.37 (cF @ sK3 = $false)), 0.16/0.37 inference(trivial_inequality_removal,[],[f89])). 0.16/0.37 tff(f109,plain,( 0.16/0.37 ($false = $true) | (sK1 != sK3)), 0.16/0.37 inference(superposition,[],[f90,f49])). 0.16/0.37 tff(f114,plain,( 0.16/0.37 (sK1 != sK3)), 0.16/0.37 inference(trivial_inequality_removal,[],[f109])). 0.16/0.37 tff(f115,plain,( 0.16/0.37 ($true = sK3) | ($true = sK1)), 0.16/0.37 inference(binary_proxy_clausification,[],[f114])). 0.16/0.37 tff(f116,plain,( 0.16/0.37 ($false = sK3) | ($false = sK1)), 0.16/0.37 inference(binary_proxy_clausification,[],[f114])). 0.16/0.37 tff(f164,plain,( 0.16/0.37 ($false = $true) | (sK0 != sK3)), 0.16/0.37 inference(superposition,[],[f84,f30])). 0.16/0.37 tff(f169,plain,( 0.16/0.37 (sK0 != sK3)), 0.16/0.37 inference(trivial_inequality_removal,[],[f164])). 0.16/0.37 tff(f171,plain,( 0.16/0.37 ($false = sK3) | ($false = sK0)), 0.16/0.37 inference(binary_proxy_clausification,[],[f169])). 0.16/0.37 tff(f192,plain,( 0.16/0.37 ($false = $true) | ($false = sK0) | ($true = sK1)), 0.16/0.37 inference(superposition,[],[f171,f115])). 0.16/0.37 tff(f199,plain,( 0.16/0.37 ($true = sK1) | ($false = sK0)), 0.16/0.37 inference(trivial_inequality_removal,[],[f192])). 0.16/0.37 tff(f248,plain,( 0.16/0.37 ($false = $true) | ($false = sK0) | ($false = sK0)), 0.16/0.37 inference(superposition,[],[f199,f66])). 0.16/0.37 tff(f254,plain,( 0.16/0.37 ($false = $true) | ($false = sK0)), 0.16/0.37 inference(duplicate_literal_removal,[],[f248])). 0.16/0.37 tff(f255,plain,( 0.16/0.37 ($false = sK0)), 0.16/0.37 inference(trivial_inequality_removal,[],[f254])). 0.16/0.37 tff(f257,plain,( 0.16/0.37 (cG @ $false = $true)), 0.16/0.37 inference(backward_demodulation,[],[f255,f30])). 0.16/0.37 tff(f258,plain,( 0.16/0.37 ($false = $true) | ($true = sK1)), 0.16/0.37 inference(backward_demodulation,[],[f255,f65])). 0.16/0.37 tff(f275,plain,( 0.16/0.37 ($true = sK1)), 0.16/0.37 inference(trivial_inequality_removal,[],[f258])). 0.16/0.37 tff(f278,plain,( 0.16/0.37 ($false = $true) | ($false = sK3)), 0.16/0.37 inference(backward_demodulation,[],[f275,f116])). 0.16/0.37 tff(f295,plain,( 0.16/0.37 ($false = sK3)), 0.16/0.37 inference(trivial_inequality_removal,[],[f278])). 0.16/0.37 tff(f296,plain,( 0.16/0.37 (cG @ $false = $false)), 0.16/0.37 inference(backward_demodulation,[],[f295,f84])). 0.16/0.37 tff(f302,plain,( 0.16/0.37 ($false = $true)), 0.16/0.37 inference(backward_demodulation,[],[f296,f257])). 0.16/0.37 tff(f303,plain,( 0.16/0.37 $false), 0.16/0.37 inference(trivial_inequality_removal,[],[f302])). 0.16/0.37 % SZS output end Proof for theBenchmark 0.16/0.37 % (18657)------------------------------ 0.16/0.37 % (18657)Version: Vampire 4.5.0 (commit 7ae30c7f on 2020-06-30 15:57:20 +0100) 0.16/0.37 % (18657)Termination reason: Refutation 0.16/0.37 0.16/0.37 % (18657)Memory used [KB]: 5373 0.16/0.37 % (18657)Time elapsed: 0.034 s 0.16/0.37 % (18657)------------------------------ 0.16/0.37 % (18657)------------------------------ 0.16/0.37 % (18642)Success in time 0.054 s 0.16/0.37 EOF